Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
نویسندگان
چکیده
منابع مشابه
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
This paper describes Fortran subroutines for computing approximate solutions to the weighted MAX-SAT problem using a greedy randomized adaptive search procedure (GRASP). The algorithm [Resende, Pitsoulis, and Pardalos, 1997] is briefly outlined and its implementation is discussed. Usage of the subroutines is considered in detail. The subroutines are tested on a set of test problems, illustratin...
متن کاملFortran Subroutines for Computing Approximate Solutions of Feedback Set Problems Using Grasp
We describe FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). The algorithms are described in detail. Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time. The source code can be...
متن کاملA Parallel GRASP for MAX-SAT Problems
The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved
متن کاملSolving MAX-SAT and Weighted MAX-SAT Problems Using Branch-and-Cut
We describe a branch and cut algorithm for both MAX-SAT and weighted MAX-SAT. This algorithm uses the GSAT procedure as a primal heuristic. At each node we solve a linear programming (LP) relaxation of the problem. Two styles of separating cuts are added: resolution cuts and odd cycle inequalities. We compare our algorithm to an extension of the Davis Putnam Loveland (EDPL) algorithm and a Semi...
متن کاملA Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
We describe a two phase algorithm for MAX{SAT and weighted MAX{ SAT problems. In the rst phase, we use the GSAT heuristic to nd a good solution to the problem. In the second phase, we use an enumera-tion procedure based on the Davis{Putnam{Loveland algorithm, to nd a provably optimal solution. The rst heuristic stage improves the performance of the algorithm by obtaining an upper bound on the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00171-7